Counting rooted maps by genus III: Nonseparable maps
نویسندگان
چکیده
منابع مشابه
Counting rooted maps on a surface
Several enumeration results are known about rooted maps on orientable surfaces, whereas rooted maps on non-orientable surfaces have seldom been studied. First, we unify both kind of maps, giving general functional equations for the generating series which counts rooted maps on any locally orientable surface, by number of vertices and faces. Then, we formally solve these equations, in order to e...
متن کاملCharacter Theory and Rooted Maps in an Orientable Surface of given Genus: Face-colored Maps
The character theoretic approach [5] to the enumeration of rooted maps in an orientable surface of arbitrary genus is extended to 2-face-colorable rooted maps. In particular, we show that there exists, for each genus, a correspondence between the set of 2-colored triangulations and a set of 2-colored rooted maps of all lower genera with a distinguished subset of vertices.
متن کاملRaney Paths and a Combinatorial Relationship between Rooted Nonseparable Planar Maps and Two-Stack-Sortable Permutations
An encoding of the set of two-stack-sortable permutations (TSS) in terms of lattice paths and ordered lists of strings is obtained. These lattice paths are called Raney paths. The encoding yields combinatorial decompositions for two complementary subsets of TSS, which are the analogues of previously known decompositions for the set of nonseparable rooted planar maps (NS). This provides a combin...
متن کاملFactoring N-Cycles and Counting Maps of Given Genus
We present an explicit expression for the number of decompositions of an n−cycle as a product of any two permutations of cycle types given by partitions λ and μ. The same expression is also counting the number of unicellular rooted bicolored maps on an orientable surface of genus g with vertex degree distribution given by λ and μ. The relation between the genus and the partitions λ and μ is giv...
متن کاملEfficient enumeration of rooted maps of a given orientable genus by number of faces and vertices
We simplify the recurrence satisfied by the polynomial part of the generating function that counts rooted maps of positive orientable genus g by number of vertices and faces. We have written an optimized program in C++ for computing this generating function and constructing tables of numbers of rooted maps, and we describe some of these optimizations here. Using this program we extended the enu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1975
ISSN: 0095-8956
DOI: 10.1016/0095-8956(75)90050-7